全文获取类型
收费全文 | 1674篇 |
免费 | 53篇 |
国内免费 | 78篇 |
专业分类
化学 | 372篇 |
晶体学 | 8篇 |
力学 | 78篇 |
综合类 | 8篇 |
数学 | 783篇 |
物理学 | 556篇 |
出版年
2024年 | 1篇 |
2023年 | 37篇 |
2022年 | 34篇 |
2021年 | 39篇 |
2020年 | 42篇 |
2019年 | 43篇 |
2018年 | 22篇 |
2017年 | 40篇 |
2016年 | 50篇 |
2015年 | 45篇 |
2014年 | 93篇 |
2013年 | 129篇 |
2012年 | 84篇 |
2011年 | 106篇 |
2010年 | 119篇 |
2009年 | 124篇 |
2008年 | 112篇 |
2007年 | 122篇 |
2006年 | 91篇 |
2005年 | 48篇 |
2004年 | 54篇 |
2003年 | 42篇 |
2002年 | 37篇 |
2001年 | 23篇 |
2000年 | 25篇 |
1999年 | 22篇 |
1998年 | 23篇 |
1997年 | 27篇 |
1996年 | 35篇 |
1995年 | 18篇 |
1994年 | 27篇 |
1993年 | 13篇 |
1992年 | 13篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 5篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1978年 | 5篇 |
1977年 | 2篇 |
1972年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有1805条查询结果,搜索用时 15 毫秒
1.
The heterogeneity nature of networks is the most eminent characteristic in 5G vehicular cognitive radio networks across complex radio environments. Since multiple communicating radios may be in motion at the same time in a vehicle. So, group mobility is the most prominent characteristic that requires to be a deep investigation. Therefore, different communication radios that are moving on a train/bus needed to select the networks simultaneously. Without considering the group mobility feature, there is a possibility that the same network may be selected by each moving node and cause congestion in a particular network. To overcome this problem, a novel network selection technique considering the group mobility feature is proposed to improve the throughput of the network. In this work, a 5G vehicular cognitive radio network scenario is also realized using USRP-2954 and LabVIEW communications system design suite testbed. The performance metrics like transmission delay, packet loss rate, reject rate and, channel utilization for vehicular nodes, are gained to analyze the proposed technique in vehicular cognitive radio networks environment. The proposed technique demonstrates a remarkable improvement in channel utilization for vehicular nodes and outperformed conventional schemes. 相似文献
2.
Gang Li Libo Liao Xinchou Lou Peixun Shen Weimin Song Shudong Wang Zhaoling Zhang 《中国物理C(英文版)》2022,46(11):113001-113001-8
Various Higgs factories are proposed to study the Higgs boson precisely and systematically in a model- independent way. In this study, the Particle Flow Network and ParticleNet techniques are used to classify the Higgs decays into multicategories, and the ultimate goal is to realize an "end-to-end" analysis. A Monte Carlo simulation study is performed to demonstrate the feasibility, and the performance looks rather promising. This result could be the basis of a "one-stop" analysis to measure all the branching fractions of the Higgs decays simultaneously. 相似文献
3.
《Arabian Journal of Chemistry》2022,15(7):103915
There is a growing attention to the bio and renewable energies due to fast depletion of fossil fuels as well as the global warming problem. Here, we developed a modeling and simulation method by means of artificial intelligence (AI) for prediction of the bioenergy production from vegetable bean oil. AI methods are well known for prediction of complex and nonlinear process. Three distinct Adaptive Boosted models including Huber regression, LASSO, and Support Vector Regression (SVR) as well as artificial neural network (ANN) were applied in this study to predict actual yield of Fatty acid methyl esters (FAME) production. All boosted utilizing the Adaptive boosting algorithm. The important influencing parameters on the biodiesel production such as the catalyst loading (CAO/Ag, wt%) and methanol to oil (Soybean oil) molar ratio were selected as the input variables of models while the yield of FAME production was selected as output. Model hyper-parameters were tuned to maintain generality while improving prediction accuracy. The models were evaluated using three distinct metrics Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and R2. Error rates of 8.16780E-01, 4.43895E-01, 2.06692E + 00, and 3.92713 E-01 were obtained with the MAE metric for boosted Huber, SVR, LASSO and ANN models. On the other hand, the RMSE error of these models were about 1.092E-02, 1.015E-02, 2.669E-02, and 1.01174E-02, respectively. Finally, the R-square score were calculated for boosted Huber, boosted SVR, and boosted LASSO as 0.976, 0.990, 0.872, and 0.99702, respectively. Therefore, it can be concluded that although the boosted SVR and ANN models were better models for prediction of process efficiency in terms of error, but all algorithms had high accuracy. The optimum yield of 83.77% and 81.60% for biodiesel production were observed at optimum operating values from boosted SVR and ANN models, respectively. 相似文献
4.
5.
基于深度学习的方法,在HL-2A装置上开发出了一套边缘局域模(ELM)实时识别算法。算法使用5200次放电数据(约24.19万数据切片)进行学习,得到一个深度为22层的卷积神经网络。为衡量算法的识别能力,识别了HL-2A装置自2009年实现稳定ELMy H模放电以来所有历史数据(约26000次放电数据),共识别出1665次H模放电,其中误识别35次,误报率为2.10%。在实际的1634次H模放电中,漏识别4次,漏识别率为0.24%。该误报率和漏报率可以满足ELM实时识别的精度要求。识别算法在实时控制环境下,对单个时间点的平均计算时间为0.46ms,可以满足实时控制的计算速度要求。 相似文献
6.
Global approximation to arbitrary cost functions: A Bayesian approach with application to US banking
Panayotis G. Michaelides Efthymios G. Tsionas Angelos T. Vouldis Konstantinos N. Konstantakis 《European Journal of Operational Research》2015
This paper proposes and estimates a globally flexible functional form for the cost function, which we call Neural Cost Function (NCF). The proposed specification imposes a priori and satisfies globally all the properties that economic theory dictates. The functional form can be estimated easily using Markov Chain Monte Carlo (MCMC) techniques or standard iterative SURE. We use a large panel of U.S. banks to illustrate our approach. The results are consistent with previous knowledge about the sector and in accordance with mathematical production theory. 相似文献
7.
《Physics letters. A》2019,383(17):2028-2032
We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible. 相似文献
8.
We consider the problem of sending a message from a sender to a receiver through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from reaches when the edges of the network fail independently with probability .We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of . In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain. 相似文献
9.
Clara Argerich Martín Ruben Ibáñez Pinillo Anais Barasinski Francisco Chinesta 《Comptes Rendus Mecanique》2019,347(11):754-761
The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm. 相似文献
10.